Hybrid Estimation of Distribution Algorithm for Multiobjective Knapsack Problem

نویسندگان

  • Hui Li
  • Qingfu Zhang
  • Edward P. K. Tsang
  • John A. Ford
چکیده

We propose a hybrid estimation of distribution algorithm (MOHEDA) for solving the multiobjective 0/1 knapsack problem (MOKP). Local search based on weighted sum method is proposed, and random repair method (RRM) is used to handle the constraints. Moreover, for the purpose of diversity preservation, a new and fast clustering method, called stochastic clustering method (SCM), is also introduced for mixturebased modelling. The experimental results indicate that MOHEDA outperforms several other state-of-the-art algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A hybrid genetic/immune strategy to tackle the multiobjective quadratic assignment problem

The Genetic Immune Strategy for Multiple Objective Optimization (GISMOO) is a hybrid algorithm for solving multiobjective problems. The performance of this approach has been assessed using a classical combinatorial multiobjective optimization benchmark: the multiobjective 0/1 knapsack problem (MOKP) [1] and two-dimensional unconstrained multiobjective problems (ZDT) [2]. This paper shows that t...

متن کامل

Multiobjective Bayesian Optimization Algorithm for Combinatorial Problems: Theory and practice

This paper deals with the utilizing of the Bayesian optimization algorithm (BOA) for the multiobjective optimization of combinatorial problems. Three probabilistic models used in the Estimation Distribution Algorithms (EDA), such as UMDA, BMDA and BOA which allow to search effectively on the promising areas of the combinatorial search space are discussed. The main attention is focused on the in...

متن کامل

Hybrid Particle Swarm Algorithm for Solving Multidimensional Knapsack Problem

In order to effectively solve combinatorial optimization problems, the Estimation of Distribution Algorithm (EDA) and Particle Swarm Optimization (PSO) combine to form a new ED-PSO hybrid algorithm, the algorithm can effectively apply global statistical information and global optimal solution to the solution space search. This algorithm is used to solve the Multidimensional Knapsack Problem (MK...

متن کامل

MOEA/D with Uniform Design for Solving Multiobjective Knapsack Problems

The 0/1 knapsack problem is a well-known problem, which appears in many real domains with practical importance. The problem is NP-complete. The multiobjective 0/1 knapsack problem is a generalization of the 0/1 knapsack problem in which multiple knapsacks are considered. Many algorithms have been proposed in the past five decades for both single and multiobjective knapsack problems. A new versi...

متن کامل

Improving the performance of evolutionary algorithms for the multiobjective 0/1 knapsack problem using ϵ -dominance

The 0/1 knapsack problem is a well known problem occurring in many real world problems. The problem is NP-Complete. The multiobjective 0/1 knapsack problem is a generalization of the 0/1 knapsack problem in which multiple knapsacks are considered. A new evolutionary algorithm for solving multiobjective 0/1 knapsack problem is proposed in this paper. This algorithm used a ε-dominance relation fo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004